Parallel Homology Computation of Meshes
نویسندگان
چکیده
In this paper, we propose a method to compute, in parallel, the homology groups of closed meshes (i.e., orientable 2D manifolds without boundary) represented by combinatorial maps. Our experiments illustrate the interest of our approach which is really fast on big meshes and which obtains good speed-up when increasing the number of threads.
منابع مشابه
Multiresolution Computation of Conformal Structures of Surfaces
An efficient multiresolution method to compute global conformal structures of nonzero genus triangle meshes is introduced. The homology, cohomology groups of meshes are computed explicitly, then a basis of harmonic one forms and a basis of holomorphic one forms are constructed. A progressive mesh is generated to represent the original surface at different resolutions. The conformal structure is...
متن کاملHomology and Cohomology Computation in Finite Element Modeling
A homology and cohomology solver for finite element meshes is represented. It is an integrated part of the finite element mesh generator Gmsh. We demonstrate the exploitation of the cohomology computation results in a finite element solver, and use an induction heating problem as a working example. The homology and cohomology solver makes the use of a vectorscalar potential formulation straight...
متن کاملPaper Submitted To: Third National Symposium on Large-scale Structural Analysis for High-performance Computers and Workstations Computational Results for Parallel Unstructured Mesh Computations
The majority of nite element models in structural engineering are composed of unstructured meshes. These unstructured meshes are often very large and require signiicant computational resources; hence they are excellent candidates for massively parallel computation. Parallel solution of the sparse matrices that arise from such meshes has been studied heavily, and many good algorithms have been d...
متن کاملParallel computation framework for optimizing trailer routes in bulk transportation
We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...
متن کاملParallel Automated Adaptive Procedures for Unstructured Meshes
Consideration is given to the techniques required to support adaptive analysis of automatically generated unstructured meshes on distributed memory MIMD parallel computers. The key areas of new development are focused on the support of effective parallel computations when the structure of the numerical discretization, the mesh, is evolving, and in fact constructed, during the computation. All t...
متن کامل